Chance Constrained Bottleneck Spanning Tree Problem with Fuzzy Random Edge Costs
نویسندگان
چکیده
This paper considers a generalized fuzzy random version of bottleneck spanning tree problem in which edge costs are fuzzy random variables. The problem is to find an optimal spanning tree under chance constraint with respect to possibility measure of bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a deterministic equivalent problem. Then its subproblem is introduced and a close relation between these problems is clarified. Finally, fully utilizing this relation, we propose a polynomial order algorithm that finds an optimal spanning tree under two special functions.
منابع مشابه
Chance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems
This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...
متن کاملFuzzy quadratic minimum spanning tree problem
In this paper, a fuzzy quadratic minimum spanning tree problem is formulated as expected value model, chance-constrained programming and dependent-chance programming according to different decision criteria. Then the crisp equivalents are derived when the fuzzy costs are characterized by trapezoidal fuzzy numbers. Furthermore, a simulation-based genetic algorithm using Prüfer number representat...
متن کاملRisk-Control Approach for a Bottleneck Spanning Tree Problem with the Total Network Reliability under Uncertainty
This paper considers a new risk-control and management approach for a bottleneck spanning tree problem under the situation where edge costs in a given network include randomness and reliability. Particularly, this paper focuses on the case that only mean value and variance of edge costs are calculated without assuming a specific random distribution. In order to develop the risk control approach...
متن کاملDATA ENVELOPMENT ANALYSIS WITH FUZZY RANDOM INPUTS AND OUTPUTS: A CHANCE-CONSTRAINED PROGRAMMING APPROACH
In this paper, we deal with fuzzy random variables for inputs andoutputs in Data Envelopment Analysis (DEA). These variables are considered as fuzzyrandom flat LR numbers with known distribution. The problem is to find a method forconverting the imprecise chance-constrained DEA model into a crisp one. This can bedone by first, defuzzification of imprecise probability by constructing a suitablem...
متن کاملA Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
متن کامل